0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : run_E %s %d THM 0.13/0.33 % Computer : n013.cluster.edu 0.13/0.33 % Model : x86_64 x86_64 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.33 % Memory : 8042.1875MB 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.33 % CPULimit : 1440 0.13/0.33 % WCLimit : 180 0.13/0.33 % DateTime : Thu Jul 4 04:08:54 EDT 2024 0.13/0.34 % CPUTime : 0.21/0.49 Running higher-order theorem proving 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.PZqo0nuA8T/E---3.1_10207.p 0.21/0.51 # Version: 3.2.0-ho 0.21/0.51 # Preprocessing class: HSSSSMSSSSSNFFN. 0.21/0.51 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.51 # Starting new_ho_10 with 900s (5) cores 0.21/0.51 # Starting ho_unfolding_6 with 180s (1) cores 0.21/0.51 # Starting sh4l with 180s (1) cores 0.21/0.51 # Starting ehoh_best_nonlift_rwall with 180s (1) cores 0.21/0.51 # new_ho_10 with pid 10312 completed with status 0 0.21/0.51 # Result found by new_ho_10 0.21/0.51 # Preprocessing class: HSSSSMSSSSSNFFN. 0.21/0.51 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.51 # Starting new_ho_10 with 900s (5) cores 0.21/0.51 # No SInE strategy applied 0.21/0.51 # Search class: HHUNS-FFSF21-SFFFFFNN 0.21/0.51 # partial match(1): FHUNS-FFSF21-SFFFFFNN 0.21/0.51 # Scheduled 6 strats onto 5 cores with 900 seconds (900 total) 0.21/0.51 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 487s (1) cores 0.21/0.51 # Starting new_ho_10 with 91s (1) cores 0.21/0.51 # Starting new_bool_3 with 82s (1) cores 0.21/0.51 # Starting new_bool_1 with 82s (1) cores 0.21/0.51 # Starting sh5l with 82s (1) cores 0.21/0.51 # sh5l with pid 10321 completed with status 0 0.21/0.51 # Result found by sh5l 0.21/0.51 # Preprocessing class: HSSSSMSSSSSNFFN. 0.21/0.51 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.51 # Starting new_ho_10 with 900s (5) cores 0.21/0.51 # No SInE strategy applied 0.21/0.51 # Search class: HHUNS-FFSF21-SFFFFFNN 0.21/0.51 # partial match(1): FHUNS-FFSF21-SFFFFFNN 0.21/0.51 # Scheduled 6 strats onto 5 cores with 900 seconds (900 total) 0.21/0.51 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 487s (1) cores 0.21/0.51 # Starting new_ho_10 with 91s (1) cores 0.21/0.51 # Starting new_bool_3 with 82s (1) cores 0.21/0.51 # Starting new_bool_1 with 82s (1) cores 0.21/0.51 # Starting sh5l with 82s (1) cores 0.21/0.51 # Preprocessing time : 0.001 s 0.21/0.51 # Presaturation interreduction done 0.21/0.51 0.21/0.51 # Proof found! 0.21/0.51 # SZS status Theorem 0.21/0.51 # SZS output start CNFRefutation 0.21/0.51 thf(decl_22, type, cD: $i > $i > $i > $o). 0.21/0.51 thf(decl_23, type, cF: $i > $i > $o). 0.21/0.51 thf(decl_24, type, cS: $i > $i > $o). 0.21/0.51 thf(decl_25, type, esk1_1: $i > $i). 0.21/0.51 thf(decl_26, type, esk2_1: $i > $i). 0.21/0.51 thf(decl_27, type, esk3_0: $i). 0.21/0.51 thf(decl_28, type, esk4_1: $i > $i). 0.21/0.51 thf(decl_29, type, esk5_1: $i > $i). 0.21/0.51 thf(decl_30, type, esk6_2: $i > $i > $i). 0.21/0.51 thf(decl_31, type, esk7_2: $i > $i > $i). 0.21/0.51 thf(cX2138, conjecture, (?[X1:$i]:(![X2:$i]:(?[X3:$i]:(![X4:$i]:(((cS @ X3 @ X4)=>![X5:$i]:(((cF @ X4 @ X5)=>(cD @ X5 @ X1 @ X2))))))))<=((![X6:$i]:(?[X1:$i]:((cF @ X6 @ X1)))&![X2:$i]:(?[X7:$i]:(![X8:$i, X9:$i]:((![X1:$i, X5:$i]:((((cF @ X8 @ X1)&(cF @ X9 @ X5))=>(cD @ X1 @ X5 @ X2)))<=(cD @ X8 @ X9 @ X7))))))&?[X6:$i]:(![X2:$i]:(?[X10:$i]:(![X4:$i]:(((cD @ X4 @ X6 @ X2)<=(cS @ X10 @ X4)))))))), file('/export/starexec/sandbox2/tmp/tmp.PZqo0nuA8T/E---3.1_10207.p', cX2138)). 0.21/0.51 thf(c_0_1, negated_conjecture, ~((((![X6:$i]:(?[X1:$i]:((cF @ X6 @ X1)))&![X2:$i]:(?[X7:$i]:(![X8:$i, X9:$i]:(((cD @ X8 @ X9 @ X7)=>![X1:$i, X5:$i]:((((cF @ X8 @ X1)&(cF @ X9 @ X5))=>(cD @ X1 @ X5 @ X2))))))))&?[X6:$i]:(![X2:$i]:(?[X10:$i]:(![X4:$i]:(((cS @ X10 @ X4)=>(cD @ X4 @ X6 @ X2)))))))=>?[X1:$i]:(![X2:$i]:(?[X3:$i]:(![X4:$i]:(((cS @ X3 @ X4)=>![X5:$i]:(((cF @ X4 @ X5)=>(cD @ X5 @ X1 @ X2)))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cX2138])])). 0.21/0.51 thf(c_0_2, negated_conjecture, ![X28:$i, X30:$i, X32:$i, X33:$i, X34:$i, X35:$i, X37:$i, X39:$i, X40:$i, X42:$i]:(((((cF @ X28 @ (esk1_1 @ X28))&(~(cD @ X32 @ X33 @ (esk2_1 @ X30))|(~(cF @ X32 @ X34)|~(cF @ X33 @ X35)|(cD @ X34 @ X35 @ X30))))&(~(cS @ (esk4_1 @ X37) @ X39)|(cD @ X39 @ esk3_0 @ X37)))&((cS @ X42 @ (esk6_2 @ X40 @ X42))&((cF @ (esk6_2 @ X40 @ X42) @ (esk7_2 @ X40 @ X42))&~(cD @ (esk7_2 @ X40 @ X42) @ X40 @ (esk5_1 @ X40)))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 0.21/0.51 thf(c_0_3, negated_conjecture, ![X1:$i, X2:$i]:(((cD @ X2 @ esk3_0 @ X1)|~((cS @ (esk4_1 @ X1) @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.51 thf(c_0_4, negated_conjecture, ![X2:$i, X1:$i]:((cS @ X1 @ (esk6_2 @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.51 thf(c_0_5, negated_conjecture, ![X1:$i, X3:$i, X2:$i, X4:$i, X5:$i]:(((cD @ X4 @ X5 @ X3)|~((cD @ X1 @ X2 @ (esk2_1 @ X3)))|~((cF @ X1 @ X4))|~((cF @ X2 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.51 thf(c_0_6, negated_conjecture, ![X1:$i, X2:$i]:((cD @ (esk6_2 @ X1 @ (esk4_1 @ X2)) @ esk3_0 @ X2)), inference(spm,[status(thm)],[c_0_3, c_0_4])). 0.21/0.51 thf(c_0_7, negated_conjecture, ![X1:$i, X4:$i, X3:$i, X2:$i]:(((cD @ X1 @ X2 @ X3)|~((cF @ (esk6_2 @ X4 @ (esk4_1 @ (esk2_1 @ X3))) @ X1))|~((cF @ esk3_0 @ X2)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 0.21/0.51 thf(c_0_8, negated_conjecture, ![X1:$i, X2:$i]:((cF @ (esk6_2 @ X1 @ X2) @ (esk7_2 @ X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.51 thf(c_0_9, negated_conjecture, ![X2:$i, X1:$i]:(~((cD @ (esk7_2 @ X1 @ X2) @ X1 @ (esk5_1 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.51 thf(c_0_10, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:(((cD @ (esk7_2 @ X1 @ (esk4_1 @ (esk2_1 @ X2))) @ X3 @ X2)|~((cF @ esk3_0 @ X3)))), inference(spm,[status(thm)],[c_0_7, c_0_8])). 0.21/0.51 thf(c_0_11, negated_conjecture, ![X1:$i]:(~((cF @ esk3_0 @ X1))), inference(spm,[status(thm)],[c_0_9, c_0_10])). 0.21/0.51 thf(c_0_12, negated_conjecture, ![X1:$i]:((cF @ X1 @ (esk1_1 @ X1))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.51 thf(c_0_13, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_11, c_0_12]), ['proof']). 0.21/0.51 # SZS output end CNFRefutation 0.21/0.51 # Parsed axioms : 4 0.21/0.51 # Removed by relevancy pruning/SinE : 0 0.21/0.51 # Initial clauses : 9 0.21/0.51 # Removed in clause preprocessing : 3 0.21/0.51 # Initial clauses in saturation : 6 0.21/0.51 # Processed clauses : 16 0.21/0.51 # ...of these trivial : 0 0.21/0.51 # ...subsumed : 0 0.21/0.51 # ...remaining for further processing : 16 0.21/0.51 # Other redundant clauses eliminated : 0 0.21/0.51 # Clauses deleted for lack of memory : 0 0.21/0.51 # Backward-subsumed : 2 0.21/0.51 # Backward-rewritten : 0 0.21/0.51 # Generated clauses : 7 0.21/0.51 # ...of the previous two non-redundant : 6 0.21/0.51 # ...aggressively subsumed : 0 0.21/0.51 # Contextual simplify-reflections : 0 0.21/0.51 # Paramodulations : 7 0.21/0.51 # Factorizations : 0 0.21/0.51 # NegExts : 0 0.21/0.51 # Equation resolutions : 0 0.21/0.51 # Disequality decompositions : 0 0.21/0.51 # Total rewrite steps : 0 0.21/0.51 # ...of those cached : 0 0.21/0.51 # Propositional unsat checks : 0 0.21/0.51 # Propositional check models : 0 0.21/0.51 # Propositional check unsatisfiable : 0 0.21/0.51 # Propositional clauses : 0 0.21/0.51 # Propositional clauses after purity: 0 0.21/0.51 # Propositional unsat core size : 0 0.21/0.51 # Propositional preprocessing time : 0.000 0.21/0.51 # Propositional encoding time : 0.000 0.21/0.51 # Propositional solver time : 0.000 0.21/0.51 # Success case prop preproc time : 0.000 0.21/0.51 # Success case prop encoding time : 0.000 0.21/0.51 # Success case prop solver time : 0.000 0.21/0.51 # Current number of processed clauses : 8 0.21/0.51 # Positive orientable unit clauses : 4 0.21/0.51 # Positive unorientable unit clauses: 0 0.21/0.51 # Negative unit clauses : 2 0.21/0.51 # Non-unit-clauses : 2 0.21/0.51 # Current number of unprocessed clauses: 2 0.21/0.51 # ...number of literals in the above : 6 0.21/0.51 # Current number of archived formulas : 0 0.21/0.51 # Current number of archived clauses : 8 0.21/0.51 # Clause-clause subsumption calls (NU) : 2 0.21/0.51 # Rec. Clause-clause subsumption calls : 0 0.21/0.51 # Non-unit clause-clause subsumptions : 0 0.21/0.51 # Unit Clause-clause subsumption calls : 3 0.21/0.51 # Rewrite failures with RHS unbound : 0 0.21/0.51 # BW rewrite match attempts : 0 0.21/0.51 # BW rewrite match successes : 0 0.21/0.51 # Condensation attempts : 16 0.21/0.51 # Condensation successes : 0 0.21/0.51 # Termbank termtop insertions : 1082 0.21/0.51 # Search garbage collected termcells : 305 0.21/0.51 0.21/0.51 # ------------------------------------------------- 0.21/0.51 # User time : 0.002 s 0.21/0.51 # System time : 0.002 s 0.21/0.51 # Total time : 0.004 s 0.21/0.51 # Maximum resident set size: 1824 pages 0.21/0.51 0.21/0.51 # ------------------------------------------------- 0.21/0.51 # User time : 0.010 s 0.21/0.51 # System time : 0.010 s 0.21/0.51 # Total time : 0.019 s 0.21/0.51 # Maximum resident set size: 1700 pages 0.21/0.51 % E---3.1 exiting 0.21/0.51 % E exiting 0.21/0.51 EOF